package T700;

/**
 * @Author cheng.song
 * @create 2022/1/26 16:27
 */
public class 二分查找704 {

    public static void main(String[] args) {
        int[] nums = new int[]{-1,0,3,5,9,12};
        System.out.println(search(nums,9));
    }

    public static int search(int[] nums, int target) {
        int left =0;
        int right = nums.length-1;
        while (left!=right){
            int mid = (left+right)/2;
            if(nums[mid]==target)
                return mid;
            if(nums[mid]>target){
                right = mid-1;
            }else if(nums[mid]<target){
                left = mid+1;
            }
        }
        return -1;
    }

}
